Solution Strategies for Multi-domain Constraint Logic Programs
نویسندگان
چکیده
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approach easily yields a CLP language with support for solver cooperation. Applying the strategy definition framework of Meta-S we define classical search strategies and more sophisticated ones, that allow an efficient evaluation of multi-domain constraint logic programs.
منابع مشابه
Strategies for the Efficient Solution of Hybrid Constraint Logic Programs
Meta-S is a system for defining the cooperation and coordination of constraint solvers to attack hybrid constraint problems. The integration of a logic programming language into this system by considering the language evaluation mechanism resolution as constraint solver yields a CLP language with support for solver cooperation. Using the strategy definition framework of Meta-S we define classic...
متن کاملA Multi-Formalism Modeling Framework: Formal Definitions, Model Composition and Solution Strategies
In this paper, we present a multi-formalism modeling framework (abbreviated by MFMF) for modeling and simulation. The proposed framework is defined based on the concepts of meta-models and uses object-orientation to overcome the complexities and to enhance the extensibility. The framework can be used as a basis for modeling by various formalisms and to support model composition in a unified man...
متن کاملA Multi-Formalism Modeling Framework: Formal Definitions, Model Composition and Solution Strategies
In this paper, we present a multi-formalism modeling framework (abbreviated by MFMF) for modeling and simulation. The proposed framework is defined based on the concepts of meta-models and uses object-orientation to overcome the complexities and to enhance the extensibility. The framework can be used as a basis for modeling by various formalisms and to support model composition in a unified man...
متن کاملStatic Analysis of CLP Programs over Numeric Domains
Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Since the basic operational step in program execution is a test for solvability of constraints in a given algebraic structure, CLP has in addition an algebraic semantics. CLP is then a general paradigm which may be instantiated on...
متن کاملSpecialising Finite Domain Programs Using Polyhedra
A procedure is described for tightening domain constraints of finite domain logic programs by applying a static analysis based on convex polyhedra. Individual finite domain constraints are over-approximated by polyhedra to describe the solution space over n integer variables as an n dimensional polyhedron. This polyhedron is then approximated, using projection, as an n dimensional bounding box ...
متن کامل